Analysis of a Left-Shift Binary GCD Algorithm
نویسندگان
چکیده
منابع مشابه
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common divisor of two integers by simulating a slightly modified version of the binary algorithm. The structure of our algorithm is very close to the one of the well-known Knuth-Schönhage fast gcd algorithm; although it does n...
متن کاملBinary GCD algorithm
The binary GCD algorithm, also known as Stein’s algorithm, is an algorithm that computes the greatest common divisor of two nonnegative integers. Stein’s algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction. Although the algorithm was first published by the Israeli physicist and programm...
متن کاملAn Analysis of the Generalized Binary GCD Algorithm
In this paper we analyze a slight modification of Jebelean’s version of the k-ary GCD algorithm. Jebelean had shown that on n-bit inputs, the algorithm runs in O(n) time. In this paper, we show that the average running time of our modified algorithm is O(n/ logn). This analysis involves exploring the behavior of spurious factors introduced during the main loop of the algorithm. We also introduc...
متن کاملWorst-case analysis of Weber's GCD algorithm
Recently, Ken Weber introduced an algorithm for finding the (a, b)-pairs satisfying au+ bv ≡ 0 (mod k), with 0< |a|, |b| < √ k, where (u, k) and (v, k) are coprime. It is based on Sorenson’s and Jebelean’s “k-ary reduction” algorithms. We provide a formula for N(k), the maximal number of iterations in the loop of Weber’s GCD algorithm. 1999 Elsevier Science B.V. All rights reserved.
متن کاملA modular integer GCD algorithm
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U , V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC ’93: International Symposium on Symbolic and Algebr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1994
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1030